On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Proof theory
• Mathematical logic
• Predicate logic
• Logic in computer science
• Primitive recursive functional
• Reverse mathematics
• Primitive recursive function
• Primitive recursive arithmetic
• First-order logic
• Peano axioms
• Ordinal analysis

Things that can and things that can’t be done in PRA Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Mathematical logic
• Mathematics
• Theoretical computer science
• Primitive recursive function
• Primitive recursive arithmetic
• ELEMENTARY
• Reverse mathematics
• Pairing function
• Ackermann function
• Sequence
• Recursion

Proof mining in L1-approximation Ulrich Kohlenbach a,1, Paulo Oliva a,1 a Department of Computer Science, University of Aarhus, DK-8000 Aarhus C,

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical analysis
• Mathematics
• Operator theory
• Computability theory
• Approximation theory
• Fourier analysis
• Modulus of continuity
• Primitive recursive function
• Linear temporal logic
• Differential forms on a Riemann surface

Fachbereich Mathematik Proof mining and combinatorics Program extraction for Ramsey’s theorem for pairs Vom Fachbereich Mathematik

Source URL: tuprints.ulb.tu-darmstadt.de

• Mathematics
• Topology
• Mathematical analysis
• Computability theory
• General topology
• Proof theory
• Mathematical logic
• Reverse mathematics
• BolzanoWeierstrass theorem
• HeineBorel theorem
• Intermediate value theorem
• Primitive recursive function

Some computational aspects of metric fixed point theory Ulrich Kohlenbach Department of Mathematics Darmstadt University of Technology Schlossgartenstraße 7

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical analysis
• Operator theory
• Mathematics
• Computability theory
• Contraction
• Primitive recursive function
• Differential forms on a Riemann surface
• Distribution

Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with very

Source URL: isabelle.in.tum.de

BRICS Basic Research in Computer Science BRICS RSU. Kohlenbach: On the No-Counterexample Interpretation On the No-Counterexample Interpretation

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical logic
• Logic
• Proof theory
• Computability theory
• Mathematics
• Constructivism
• Primitive recursive functional
• First-order logic
• Symbol
• Primitive recursive function
• Primitive recursive arithmetic
• Realizability

Chapter 10: RecursionObjectives The chapter provides a brief introduction to recursion, which is the practice of using a function that calls itself. Students will learn what recursion is and how to read recursive

Source URL: manual.pencilcode.net

Types of Recursion – additional note When analyzing recursive functions, one way is to break up the analysis into the work done before the recursive function application and the work done after the recursive function a

Source URL: www.student.cs.uwaterloo.ca

The Church-Scott representation of inductive and coinductive data in (typed) λ calculus Herman Geuvers Radboud University Nijmegen and Eindhoven University of Technology

Source URL: www.cs.ru.nl

• Computability theory
• Lambda calculus
• Recursion
• Theoretical computer science
• Type theory
• Combinatory logic
• Church encoding
• Initial algebra
• Primitive recursive function